A New Upper Bound for B2[2] Sets
نویسندگان
چکیده
منابع مشابه
Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملAn upper bound for B2[g] sets
Suppose g is a fixed positive integer. For N 2, a set A⊂ Z∩[1,N ] is called a B2[g] set if every integer n has at most g distinct representations as n = a + b with a, b ∈ A and a b. In this paper, we give an upper bound estimate for the size of such A, improving the existing results. © 2006 Elsevier Inc. All rights reserved. MSC: 11G05; 14H52
متن کاملA new upper bound for Achlioptas processes
We consider here on-line algorithms for Achlioptas processes. Given a initially empty graph G on n vertices, a random process that at each step selects independently and uniformly at random two edges from the set of non-edges is launched. We must choose one of the two edges and add it to the graph while discarding the other. The goal is to avoid the appearance of a connected component spanning ...
متن کاملA new upper bound for 3-SAT
We show that a randomly chosen 3-CNF formula over n variables with clauses-tovariables ratio at least 4.4898 is asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506. The first such bound, independently discovered by many groups of researchers since 1983, was 5.19. Several decreasing values between 5.19 and 4.506 were published in the years b...
متن کاملA new eigenvalue bound for independent sets
Let G be a simple, undirected, and connected graph on n vertices with eigenvalues λ1 ≤ ... ≤ λn. Moreover, let m, δ, and α denote the size, the minimum degree, and the independence number of G, respectively. W.H. Haemers proved α ≤ −λ1λn δ2−λ1λnn and, if η is the largest Laplacian eigenvalue of G, then α ≤ η−δ η n is shown by C.D. Godsil and M.W. Newman. We prove α ≤ 2σ−2 σδ m for the largest n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2001
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3084